Embedding edit distance to enable private keyword search
نویسندگان
چکیده
منابع مشابه
Low Distortion Embedding from Edit to Hamming Distance using Coupling
The Hamming and the edit metrics are two common notions of measuring distances between pairs of strings x, y lying in the Boolean hypercube. The edit distance between x and y is de ned as the minimum number of character insertion, deletion, and bit ips needed for converting x into y. Whereas, the Hamming distance between x and y is the number of bit ips needed for converting x to y. In this pap...
متن کاملMap Edit Distance vs. Graph Edit Distance for Matching Images
Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...
متن کاملA Distance-Based Spelling Suggestion Method for XML Keyword Search
Abstract. We study the spelling suggestion problem for keyword search on XML documents. To address the problems in existing work, we propose a distance-based approach to suggesting meaningful query candidates for an issued query. Our approach uses distance to measure the relationship between keyword matching nodes, and ranks a candidate higher if there are closely-related nodes in the database ...
متن کاملEdit Distance in Graphs
The focus of my research is extremal graph theory and random combinatorial structures. I have also worked in a variety of other areas, including intersecting hypergraphs, the theory of positional games and Ramsey theory. I use a number of tools in my research, notably probabilistic methods and, most prominently, Szemerédi’s regularity lemma. I have used these and other techniques to address que...
متن کاملEdit Distance to Monotonicity in Sliding Windows
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decreasing with respect to the numerical value. The space complexity of estimating the edit distance to monotonicity of a data stream is becoming well-understood over the past few years. Motivated by applications on networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human-centric Computing and Information Sciences
سال: 2012
ISSN: 2192-1962
DOI: 10.1186/preaccept-1253053215890607